Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture
نویسندگان
چکیده
منابع مشابه
Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture
We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the diameters of polyhedral graphs. One particular variant has a diameter which satisfies the best known upper bound on the diameters of polyhedra. Another variant has ...
متن کاملAn Approach to Hirsch Conjecture
W.M. Hirsch formulated a beautiful conjecture on amaximum of diameters of convex polyhedrawith both fixed dimension and number of facets. This is still unsolved for about 50 years. Here, I suggest a new method of argument from the viewpoint of deformation of polytope. As a candidate of the clue to the complete-proof, there’s some conjectures which are all sufficient for the original problem.
متن کاملAn Approach to the Hirsch Conjecture
W. M. Hirsch proposed a beautiful conjecture on diameters of convex polyhedra, which is still unsolved for about 50 years. I suggest a new method of argument from the viewpoint of deformation and moduli of polytopes. As a consequence, for example, if there are at least 3 disjoint geodisics for all Dantzig figures, as in the 3 dimensional case, the conjecture follows.
متن کاملthe aesthetic dimension of howard barkers art: a frankfurtian approach to scenes from an execution and no end of blame
رابطه ی میانِ هنر و شرایطِ اجتماعیِ زایش آن همواره در طولِ تاریخ دغدغه ی ذهنی و دل مشغولیِ اساسیِ منتقدان و نیز هنرمندان بوده است. از آنجا که هنر در قفس آهنیِ زندگیِ اجتماعی محبوس است، گسترش وابستگیِ آن با نهاد ها و اصولِ اجتماعی پیرامون، صرفِ نظر از هم سو بودن و یا غیرِ هم سو بودنِ آن نهاد ها، امری اجتناب ناپذیر به نظر می رسد. با این وجود پدیدار گشتنِ چنین مباحثِ حائز اهمییتی در میان منتقدین، با ظهورِ مکتب ما...
A counterexample to the Hirsch conjecture
The Hirsch Conjecture (1957) stated that the graph of a d-dimensional polytope with n facets cannot have (combinatorial) diameter greater than n−d. That is, any two vertices of the polytope can be connected by a path of at most n− d edges. This paper presents the first counterexample to the conjecture. Our polytope has dimension 43 and 86 facets. It is obtained from a 5-dimensional polytope wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2012
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-012-0611-2